On symmetric quadrangulations and triangulations

نویسندگان

  • Marie Albenque
  • Éric Fusy
  • Dominique Poulalhon
چکیده

This article presents new enumerative results related to symmetric planar maps. In the first part a new way of enumerating rooted simple quadrangulations and rooted simple triangulations is presented, based on the description of two different quotient operations on symmetric simple quadrangulations and triangulations. In the second part, based on results of Bouttier, Di Francesco and Guitter and on quotient and substitution operations, the series of three families of symmetric quadrangular and triangular dissections of polygons are computed, with control on the distance from the central vertex to the outer boundary.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Median problem in some plane triangulations and quadrangulations

Résumé In this note, we present linear time algorithms for computing the median set of plane triangulations with inner vertices of degree ≥ 6 and plane quadrangulations with inner vertices of degree ≥ 4. Dans cette note, nous présentons un algorithme linéaire pour calculer l’ensemble médian de triangulations planaires dont les sommets intérieurs sont de degré ≥ 6 et de quadrangulations planaire...

متن کامل

Bijections for Maps with Boundaries: Krikun’s Formula for Triangulations, and a Quadrangulation Analogue

We present bijections for planar maps with boundaries. In particular, we obtain bijections for triangulations and quadrangulations of the sphere with boundaries of prescribed lengths. For triangulations we recover the beautiful factorized formula obtained by Krikun using a (technically involved) generating function approach. The analogous formula for quadrangulations is new. Our method is to sh...

متن کامل

A bijection for triangulations, quadrangulations, pentagulations, etc

A d-angulation is a planar map with faces of degree d. We present for each integer d ≥ 3 a bijection between the class of d-angulations of girth d and a class of decorated plane trees. Each of the bijections is obtained by specializing a “master bijection” which extends an earlier construction of the first author. Bijections already existed for triangulations (d = 3) and for quadrangulations (d...

متن کامل

On the Approximation Power of Splines on Triangulated Quadrangulations

We study the approximation properties of the bivariate spline spaces S r 3r (} +) of smoothness r and degree 3r deened on triangulations } + which are obtained from arbitrary nondegenerate convex quadrangulations by adding the diagonals of each quadrilateral. Suppose } is a nondegenerate convex quadrangulation of a polygonal domain in IR 2 (see Sect. 6 for details on quadrangulations and techni...

متن کامل

A binary labeling for plane Laman graphs and quadrangulations

We present binary labelings for the angles of quadrangulations and plane Laman graphs, which are in analogy with Schnyder labelings for triangulations [W. Schnyder, Proc. 1st ACM-SIAM Symposium on Discrete Algorithms, 1990] and imply a special tree decomposition for quadrangulations. In particular, we show how to embed quadrangulations on a 2-book, so that each page contains a non-crossing alte...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Eur. J. Comb.

دوره 35  شماره 

صفحات  -

تاریخ انتشار 2014